1484B - Restore Modulo - CodeForces Solution


implementation math *1500

Please click on ads to support us..

Python Code:

import sys
input = sys.stdin.readline


for _ in range(int(input())):
    n = int(input())
    a = list(map(int, input().split()))

    if n == 1:
        print(0)
        continue

    t = set()
    for i in range(1, n):
        t.add(a[i] - a[i - 1])

    if len(t) > 2:
        print(-1)
        continue

    if len(t) == 1:
        print(0)
        continue

    d1, d2 = -1 * min(t), max(t)

    if d1 + d2 <= max(a):
        print(-1)
        continue
    print(d2 + d1, d2)


Comments

Submit
0 Comments
More Questions

230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns